The recursive Green’s function method for graphene
نویسندگان
چکیده
منابع مشابه
Electronic Transmission Wave Function of Disordered Graphene by Direct Method and Green's Function Method
We describe how to obtain electronic transport properties of disordered graphene, including the tight binding model and nearest neighbor hopping. We present a new method for computing, electronic transport wave function and Greens function of the disordered Graphene. In this method, based on the small rectangular approximation, break up the potential barriers in to small parts. Then using the f...
متن کاملelectronic transmission wave function of disordered graphene by direct method and green's function method
we describe how to obtain electronic transport properties of disordered graphene, including the tight binding model and nearest neighbor hopping. we present a new method for computing, electronic transport wave function and greens function of the disordered graphene. in this method, based on the small rectangular approximation, break up the potential barriers in to small parts. then using the f...
متن کاملModular recursive Green’s function method for ballistic quantum transport
A modification of the standard recursive Green’s function method for quantum transport through microstructures is presented which is based on the decomposition into separable substructures. The Green’s functions for these modules are joined by discretized Dyson equations. Nonseparable structures can thereby be calculated with the help of a few recursions with high accuracy. We apply this method...
متن کاملParallel implementation of the recursive Green's function method
A parallel algorithm for the implementation of the recursive Green’s function technique, which is extensively applied in the coherent scattering formalism, is developed. The algorithm performs a domain decomposition of the scattering region among the processors participating in the computation and calculates the Schur’s complement block in the form of distributed blocks among the processors. If...
متن کاملRecursive Sampling for the Nystrom Method
We give the first algorithm for kernel Nyström approximation that runs in linear time in the number of training points and is provably accurate for all kernel matrices, without dependence on regularity or incoherence conditions. The algorithm projects the kernel onto a set of s landmark points sampled by their ridge leverage scores, requiring just O(ns) kernel evaluations and O(ns) additional r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Electronics
سال: 2013
ISSN: 1569-8025,1572-8137
DOI: 10.1007/s10825-013-0458-7